翻訳と辞書 |
Robinson–Schensted–Knuth correspondence : ウィキペディア英語版 | Robinson–Schensted–Knuth correspondence In mathematics, the Robinson–Schensted–Knuth correspondence, also referred to as the RSK correspondence or RSK algorithm, is a combinatorial bijection between matrices with non-negative integer entries and pairs of semistandard Young tableaux of equal shape, whose size equals the sum of the entries of . More precisely the weight of is given by the column sums of , and the weight of by its row sums. It is a generalization of the Robinson–Schensted correspondence, in the sense that taking to be a permutation matrix, the pair will be the pair of standard tableaux associated to the permutation under the Robinson–Schensted correspondence. The Robinson–Schensted–Knuth correspondence extends many of the remarkable properties of the Robinson–Schensted correspondence, notably its symmetry: transposition of the matrix results in interchange of the tableaux . == The Robinson–Schensted–Knuth correspondence ==
抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)』 ■ウィキペディアで「Robinson–Schensted–Knuth correspondence」の詳細全文を読む
スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|